Nondeterministic finite automaton - PDFSEARCH.IO - Document Search Engine

Nondeterministic finite automaton
Results: 144

#	Item
61	Quasi-Weak Cost Automata A New Variant of Weakness Denis Kuperberg1 1 LIAFA/CNRS/Universit´ e 2 Department Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2012-10-25 13:52:50 Computer science Applied mathematics Mathematics Nondeterministic finite automaton Regular language Finite-state machine Ω-automaton Automata theory Formal languages Models of computation
62	Expressive power of Cost Logics over Infinite Words Denis Kuperberg and Michael Vanden Boom S´eminaire Automates Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2012-10-25 13:52:50 Computer science Applied mathematics Mathematics Regular language Nondeterministic finite automaton Finite-state machine Ω-automaton Omega-regular language Automata theory Formal languages Models of computation
63	Logical Methods in Computer Science Vol. 9(4:[removed], pp. 1–39 www.lmcs-online.org Submitted Published Add to Reading List Source URL: www.automata.rwth-aachen.de Language: English - Date: 2013-12-17 05:01:37 Mathematics Formal languages Computer science Combinatorics on words Theory of computation Finite-state machine Alphabet Nondeterministic finite automaton Computability Automata theory Models of computation Theoretical computer science
64	Algorithms for Guided Tree Automata Morten Biehl1 , Nils Klarlund2 , and Theis Rauhe1 1 BRICS, Department of Computer Science, University of Aarhus, Add to Reading List Source URL: www.brics.dk Language: English - Date: 2007-03-08 16:46:59 Mathematics Binary decision diagram Tree automaton Nondeterministic finite automaton Deterministic finite automaton Tree traversal Binary tree Tree Infinite tree automaton Automata theory Theoretical computer science Computer science
65	Automata on Inifinite Trees Christof L¨oding Lehrstuhl Informatik 7 RWTH Aachen[removed]Aachen, Germany email: [removed] Add to Reading List Source URL: www.automata.rwth-aachen.de Language: English - Date: 2012-05-29 10:55:51 Ω-automaton Muller automaton Alternating tree automata Tree automaton Alternating finite automaton Nondeterministic finite automaton Deterministic automaton Finite-state machine Parity game Automata theory Theoretical computer science Computer science
66	Methods for the Transformation of ω-Automata: Complexity and Connection to Second Order Logic Diploma Thesis (Revised Version) Christof L¨oding Supervisor: Prof. Dr. Wolfgang Thomas Add to Reading List Source URL: www.automata.rwth-aachen.de Language: English - Date: 2012-05-29 10:55:56 Ω-automaton Nondeterministic finite automaton Muller automaton Finite-state machine Alternating finite automaton Sequence Powerset construction Automata theory Theoretical computer science Computer science
67	Decidability Results on the Existence of Lookahead Delegators for NFA Christof Löding and Stefan Repke Lehrstuhl für Informatik 7, RWTH Aachen, Aachen, Germany Abstract Add to Reading List Source URL: www.automata.rwth-aachen.de Language: English - Date: 2014-02-07 10:22:52 Complexity classes Applied mathematics Nondeterministic finite automaton Deterministic finite automaton Lookahead PSPACE-complete NP Theoretical computer science Automata theory Models of computation
68	Microsoft Word - 03-Lexical-Analysis.doc Add to Reading List Source URL: dragonbook.stanford.edu Language: English - Date: 2008-09-08 16:58:22 Computing Nondeterministic finite automaton Lexical analysis Powerset construction Deterministic finite automaton Regular expression Finite-state machine Formal language Regular language Automata theory Programming language implementation Theoretical computer science
69	Improving the Capabilities of JFLAP Creating Effective User Interfaces in Learning for Theoretical Computer Science Ian C. McMahon Computer Science Department Duke University Add to Reading List Source URL: www.cs.duke.edu Language: English - Date: 2014-06-16 14:48:07 Theoretical computer science Computer science Finite-state machine Deterministic finite automaton Nondeterministic finite automaton Deterministic pushdown automaton Turing machine Mealy machine Algorithm Models of computation Theory of computation Automata theory
70	A Topological Perspective on Diagnosis Andreas Bauer, ANU, Australia Abstract— We propose a topological perspective on the diagnosis problem for discrete-event systems. In an infinitary framework, we argue that the con Add to Reading List Source URL: www.immerundewig.at Language: English - Date: 2008-05-27 22:19:01 Applied mathematics Büchi automaton Muller automaton Omega language Deterministic finite automaton Regular language Nondeterministic finite automaton Formal language Ω-automaton Automata theory Theoretical computer science Computer science

UPDATE